Analysis and compensation of packet loss in distributed speech recognition using interleaving
نویسندگان
چکیده
The aim of this work is to improve the robustness of speech recognition systems operating in burst-like packet loss. First a set of highly artificial packet loss profiles are used to analyse their effect on both recognition performance and on the underlying feature vector stream. This indicates that the simple technique of vector repetition can make the recogniser robust to high percentages of packet loss, providing burst lengths are reasonably short. This leads to the proposal of interleaving the feature vector sequence, prior to packetisation, to disperse bursts of packet loss throughout the feature vector stream. Recognition results on the Aurora connected digits database show considerable accuracy gains across a range of packet losses and burst lengths. For example at a packet loss rate of 50% with an average burst length of 4 packets (corresponding to 8 static vectors) performance is increased from 49.4% to 88.5% with a increase in delay of 90ms.
منابع مشابه
Combining packet loss compensation methods for robust distributed speech recognition
This paper presents a combined packet loss compensation system for distributed speech recognition (DSR). Compensation is applied at three stages within the DSR process beginning with interleaving on the terminal device to reduce burst lengths in the received feature vector stream. On the receiver side estimation of missing vectors is applied to reconstruct the feature vector stream prior to rec...
متن کاملA comparison of packet loss compensation methods and interleaving for speech recognition in burst-like packet loss
This work compares the performance of three compensation methods for speech recognition in the presence of packet loss. Two methods, cubic interpolation and a novel maximum a posteriori (MAP) estimation, aim to restore the feature vector stream in the event of packet loss, while the third technique applies compensation in the decoding stage of recognition through missing feature theory. To impr...
متن کاملA Comparison of Efficient Interleaver Designs for Real Time Distributed Speech Recognition
Packet loss presents a significant problem for distributed speech recognition systems particularly when burst lengths of loss are long. This work first proposes an extension to convolutional interleavers such that bursts of packet loss are maximally dispersed to minimise the duration of bursts of loss in the received feature vector stream. This is achieved by interleaving each dimension of the ...
متن کاملTowards improving the robustness of distributed speech recognition in packet loss
This work begins with an analysis into the effect of packet loss on the temporal components of the feature vector stream and its subsequent effect on recognition accuracy. Two methods of packet loss compensation are then compared. Reconstruction methods begin with interpolation and are extended to include prior statistical knowledge of the feature vector stream in the form of MAP estimation of ...
متن کاملAnalysis and Compensation of Pa Speech Recognition Usin
The aim of this work is to improve the robustness of speech recognition systems operating in burst-like packet loss. First a set of highly artificial packet loss profiles are used to analyse their effect on both recognition performance and on the underlying feature vector stream. This indicates that the simple technique of vector repetition can make the recogniser robust to high percentages of ...
متن کامل